A Constraint Oriented Proof Methodology Based on Modal Transition Systems
نویسندگان
چکیده
In this paper, we present a constraint-oriented state-based proof methodology for concurrent software systems which exploits compositionality and abstraction for the reduction of the verification problem under investigation. Formal basis for this methodology are Modal Transition Systems allowing loose state-based specifications, which can be refined by successively adding constraints. Key concepts of our method are projective views, separation of proof obligations, Skolemization and abstraction. The method is even applicable to real time systems.
منابع مشابه
The Methodology of Modal Constraints
We present a complete solution of the RPC-Memory Spec-iication Problem, by applying a constraint-oriented state-based proof methodology for concurrent software systems. Our methodolgy exploits compositionality and abstraction for the reduction of the veriication problem under investigation. Formal basis for this methodology are Modal Transition Systems allowing loose state-based speciications, ...
متن کاملFischer's Protocol Revisited: A Simple Proof Using Modal Constraints
As a case study, we apply a constraint-oriented state-based proof methodology to Fischer's protocol. The method exploits compo-sitionality and abstraction to reduce the investigated veriication problem. This reduction avoids state space explosion. Key concepts of the reduction process are modal constraints, separation of proof obligations, Skolemization and abstraction. Formal basis for the met...
متن کاملMethod integration: An approach to develop agent oriented methodologies
Agent oriented software engineering (AOSE) is an emerging field in computer science and proposes some systematic ideas for multi agent systems analysis, implementation and maintenance. Despite the various methodologies introduced in the agent-oriented software engineering, the main challenges are defects in different aspects of methodologies. According to the defects resulted from weaknesses ...
متن کاملTowards a Modal Logic of Durative Actions
This paper proposes an extension of modal action logics, which typically make the assumption that an action is atomic, to include durative actions. These logics have been developed to support the formal speci cation of information systems: we argue, with particular reference to object oriented systems, that assuming atomicity is too restrictive to express many kinds of temporal constraint. In c...
متن کاملBounded Petri Net Synthesis from Modal Transition Systems is Undecidable
In this paper, the synthesis of bounded Petri nets from deterministic modal transition systems is shown to be undecidable. The proof is built from three components. First, it is shown that the problem of synthesising bounded Petri nets satisfying a given formula of the conjunctive nucalculus (a suitable fragment of the mu-calculus) is undecidable. Then, an equivalence between deterministic moda...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995